Population Heuristics
نویسنده
چکیده
منابع مشابه
An integrated approach for scheduling flexible job-shop using teaching–learning-based optimization method
In this paper, teaching–learning-based optimization (TLBO) is proposed to solve flexible job shop scheduling problem (FJSP) based on the integrated approach with an objective to minimize makespan. An FJSP is an extension of basic job-shop scheduling problem. There are two sub problems in FJSP. They are routing problem and sequencing problem. If both the sub problems are solved simultaneously, t...
متن کاملSWITCHING TEAMS ALGORITHM FOR SIZING OPTIMIZATION OF TRUSS STRUCTURES
Meta-heuristics have received increasing attention in recent years. The present article introduces a novel method in such a class that distinguishes a number of artificial search agents called players within two teams. At each iteration, the active player concerns some other players in both teams to construct its special movements and to get more score. At the end of some iterations (like quart...
متن کاملU . K . Isbn : 978 - 988 - 17012 - 3 - 7 Wce 2008
used to address assembly line balancing problems (ALBP), not much attention has been given to the population initialization procedure. In this paper, a comparison is made between a randomly generated initial population and a heuristics-treated initial population. A heuristics-treated population is a mix of randomly and heuristics generated individuals in the initial population. Both populations...
متن کاملExtension of heuristics for simulating population overflow in Jackson tandem queuing networks to non-Markovian tandem queuing networks
In this paper we extend previously proposed state-dependent importance sampling heuristics for simulation of population overflow in Markovian tandem queuing networks to nonMarkovian tandem networks, and experimentally demonstrate the asymptotic efficiency of the resulting heuristics.
متن کاملEffective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons
Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and pa...
متن کاملRelax and Fix Heuristics for Simultaneous Lot Sizing and Sequencing the Permutation Flow Shops with Sequence-Dependent Setups
This paper proposes two relax and fix heuristics for the simultaneous lot sizing and sequencing problem in permutation flow shops involving sequence-dependent setups and capacity constraints. To evaluate the effectiveness of mentioned heuristics, two lower bounds are developed and compared against the optimal solution. The results of heuristics are compared with the selected lower bound .
متن کامل